منابع مشابه
On Non-overlapping Words
Let Q be the set of all primitive words over a finite alphabet having at least two letters. In this paper, we study the language D(1) of all non-overlapping (d-primitive) words, which is a proper subset of Q. We show that D(1) is a contextsensitive langauage but not a deterministic context-free language. Further it is shown that [D(1)]n is not regular for n ≥ 1. key words: primitive word, non-o...
متن کاملOverlapping factors in words
The concept of quasiperiodicity is a generalization of the notion of periodicity where in contrast to periodicity the quasiperiods of a quasiperiodic string may overlap. A lot of research has been concentrated around algorithms for the computation of quasiperiodicities in strings while not much is known about bounds on their maximum number of occurrences in words. We study the overlapping facto...
متن کامل(Non)words, (non)words, (non)words: evidence for a protolexicon during the first year of life.
Previous research with artificial language learning paradigms has shown that infants are sensitive to statistical cues to word boundaries (Saffran, Aslin & Newport, 1996) and that they can use these cues to extract word-like units (Saffran, 2001). However, it is unknown whether infants use statistical information to construct a receptive lexicon when acquiring their native language. In order to...
متن کاملThe Non - overlapping Domain
Once a decomposition of the nite element space V into two or more subspaces is given, e.g. , via domain decomposition, a speciic Multiplicative Schwarz Method (MSM) and Additve Schwarz Method (ASM) is deened. In this paper, we analyse the MSM for the decomposition induced by the approximate discrete harmonic nite element basis which was introduced in a joint paper of the authors with A. Meyer (...
متن کاملRange Non-overlapping Indexing
We study the non-overlapping indexing problem: Given a text T , preprocess it in order to answer queries of the form: given a pattern P , report the maximal set of non-overlapping occurrences of P in T . A generalization of this problem is the range non-overlapping indexing where in addition we are given two indexes i, j to report the maximal set of non-overlapping occurrences between these two...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2011
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e94.d.707